tc=int(input())
for i in range(tc):
n=int(input())
x=False
l=[int(i) for i in input().split()]
l1=sorted(l)
k=min(l)
for i in range(n):
if l[i]==l1[i]: continue
elif l[i]%k==0 and l1[i]%k==0: continue
else:
x=True
break
if x==True: print("NO")
else: print("YES")#include<bits/stdc++.h>
using namespace std;
#define ll long long
void solve(){
int n;
cin>>n;
int arr[n];
int temp[n];
for(int i=0;i<n;i++){
cin>>arr[i];
temp[i]=arr[i];
}
sort(temp,temp+n);
int small=temp[0];
vector<int>v;
for(int i=0;i<n;i++){
if(arr[i]!=temp[i])
v.push_back(arr[i]);
}
int check=1;
sort(v.begin(),v.end());
for(int i=0;i<v.size();i++){
if(v[i]%small!=0){
check=0;
break;
}
}
if(check) cout<<"YES"<<endl;
else cout<<"NO"<<endl;
}
int main(){
int t;
cin>>t;
while(t--){
solve();
}
}1551A - Polycarp and Coins | 313A - Ilya and Bank Account |
1469A - Regular Bracket Sequence | 919C - Seat Arrangements |
1634A - Reverse and Concatenate | 1619C - Wrong Addition |
1437A - Marketing Scheme | 1473B - String LCM |
1374A - Required Remainder | 1265E - Beautiful Mirrors |
1296A - Array with Odd Sum | 1385A - Three Pairwise Maximums |
911A - Nearest Minimums | 102B - Sum of Digits |
707A - Brain's Photos | 1331B - Limericks |
305B - Continued Fractions | 1165B - Polycarp Training |
1646C - Factorials and Powers of Two | 596A - Wilbur and Swimming Pool |
1462B - Last Year's Substring | 1608B - Build the Permutation |
1505A - Is it rated - 2 | 169A - Chores |
765A - Neverending competitions | 1303A - Erasing Zeroes |
1005B - Delete from the Left | 94A - Restoring Password |
1529B - Sifid and Strange Subsequences | 1455C - Ping-pong |